Broadcasting in Harary Graphs

With the increasing popularity of interconnection networks, efficient information dissemination has become a popular research area. Broadcasting is one of the information dissemination primitives. Broadcasting in a graph is the process of transmitting a message from one vertex, the originator, to all other vertices of the graph. We follow the classical model for broadcasting. This thesis studies the Harary graph in depth. First, we find the diameter of Harary graph. We present an additive approximation algorithm for the broadcast problem in Harary graph. We also provide some properties for the graph like vertex transitivity, circulant graph and regularity. In the next part we introduce modified harary graph. We calculate the diameter and broadcast time for the graph. We will also provide 1-additive approximation algorithm to find the broadcast time in the modified harary graph